Cancellativity is undecidable for automatic semigroups
نویسندگان
چکیده
Via an encoding of the Modified Post’s Correspondence Problem, this paper shows that it is undecidable whether an automatic semigroup is cancellative.
منابع مشابه
Presentations for Subsemigroups of Groups
This thesis studies subsemigroups of groups from three perspectives: automatic structures, ordinary semigroup presentations, and Malcev presentaions. [A Malcev presentation is a presentation of a special type for a semigroup that can be embedded into a group. A group-embeddable semigroup is Malcev coherent if all of its finitely generated subsemigroups admit finite Malcev presentations.] The th...
متن کامل-
In this paper we introduce R-right (left), L-left (right) cancellative and weakly R(L)-cancellative semigroups and will give some equivalent conditions for completely simple semigroups, (completely) regular right (left) cancellative semigroups, right (left) groups, rectangular groups, rectangular bands, groups and right (left) zero semigroups according to R-right (left), L-left (right) and weak...
متن کاملUniform decision problems for automatic semigrouos
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which are necessary to make the problem well defined, the uniform word problem for semigroups described by automatic structures is decidable. Under the same conditions, we show that one can also ...
متن کاملThe finiteness problem for automaton semigroups is undecidable
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton semigroups. Given a NW-deterministic Wang tile set, we construct a Mealy automaton, such that the plane admits a valid Wang tiling if and only if the Mealy autom...
متن کاملDecision problems for word-hyperbolic semigroups
This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan &Gilman. A fundamental investigation reveals that the natural definition of a ‘word-hyperbolic structure’ has to be strengthened slightly in order to define a unique semigroup up to isomorphism. The isomorphism problem is proven to be undecidable for word-hyperbolic semigroups (in contrast to the...
متن کامل